RWA Based on Approximated Path Conflict Graphs in Optical Networks
نویسندگان
چکیده
Among many solutions to Routing and Wavelength Assignment (RWA) problems based on Edge Disjoint Paths (EDP), the Path Conflict Graph (PCG) algorithm shows outstanding performance in terms of wavelength. In this paper, we improve the PCG algorithm by imposing limitations on the EDPs length based on the fact that the EDPs are longer than the average length for the rarely selected demands. We conclude that the running time of the PCG algorithm can be reduced by half even in the worst case scenario while expending fewer wavelengths than or equal to that of the BGAforEDP and MAX EDP algorithms by using the proposed PCG approximation technique.
منابع مشابه
A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملPolynomial Time Algorithm (PTA) to generate a survivable ring virtual topology for Optical WDM based on the Hamiltonian Circuit Detection Heuristics(HCDH)
The Routing and Wavelength Assignment (RWA) problem is known to be NP-hard for general Physical Topology (PT) in optical networks. We have analyzed the survivability of the optical network under Survivable Routing and Shared Path Protection (SPP) for various topologies and suggested two survivable RWA algorithms which are shown to perform better under certain performance matrix by simulation. G...
متن کاملRouting and Wavelength Assignment in All-Optical Networks
Abstracf— This paper considers the problem of routing connections in a reeontigurable optical network using wavelength division multiplexing. Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned d]fferent wavelengths. We derive an upper bound ...
متن کاملA New Proposal of an Efficient Algorithm for Routing and Wavelength Assignment in Optical Networks
The routing and wavelength assignment (RWA) algorithms used in optical networks are critical to achieve good network performance. However, despite several previous studies to optimize the RWA, which is classified as an NP-Hard, it seems that there is not, a priori, any solution that would lead to standardization of this process. This article presents the proposed RWA algorithm based on a Generi...
متن کاملResource-efficient path-protection schemes and online selection of routes in reliable WDM networks
The optimal choice of routing and wavelength assignment (RWA) for the working and protection path–pair of the newly generated demand request is often a complex problem in reliable wavelength-division-multiplexed (WDM) networks subject to dynamic traffic. The challenge is twofold: how to provide the required reliability level without over-reserving network resources and how to find a good soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005